#实现斐波那契数列递归函数实现
def Fibonacci_Recursion_tool(n):
    if n <= 0:
        return 0
    elif n == 1:
        return 1
    else:
        return Fibonacci_Recursion_tool(n - 1) + Fibonacci_Recursion_tool(n - 2)

def Fibonacci_Recursion(n):
    result_list = []
    for i in range(0, n + 1):
        result_list.append(Fibonacci_Recursion_tool(i))
    return result_list

if __name__ == '__main__':
    L3 = Fibonacci_Recursion(10)
    print(f"递归实现： {L3}")